Equivalence in Abductive Logic
نویسندگان
چکیده
We consider the problem of identifying equivalence of two knowledge bases which are capable of abductive reasoning. Here, a knowledge base is written in either first-order logic or nonmonotonic logic programming. In this work, we will give two definitions of abductive equivalence. The first one, explainable equivalence, requires that two abductive programs have the same explainability for any observation. Another one, explanatory equivalence, guarantees that any observation has exactly the same explanations in each abductive framework. Explanatory equivalence is a stronger notion than explainable equivalence. In first-order abduction, explainable equivalence can be verified by the notion of extensional equivalence in default theories. In nonmonotonic logic programs, explanatory equivalence can be checked by means of the notion of relative strong equivalence. We also show the complexity results for abductive equivalence.
منابع مشابه
On the Equivalence between Disjunctive and Abductive Logic Programs
This paper presents the equivalence relationship between disjunctive and abductive logic programs. We show that the generalized stable model semantics of abductive logic programs can be translated into the possible model semantics of disjunctive programs, and vice versa. It is also proved that abductive disjunctive programs can be expressed by abductive logic programs under the possible model s...
متن کاملRepresentation of Coloured Petri Net in Abductive Logic Programming (CPN-LP) and Its Application in Modeling an Intelligent Agent
Coloured Petri net (CPN) has been widely adopted in various areas in Computer Science, including protocol specification, performance evaluation, distributed systems and coordination in multi-agent systems. It provides a graphical representation of a system and has a strong mathematical foundation for proving various properties. This paper proposes a novel representation of a coloured Petri net ...
متن کاملContradiction: When Avoidance Equals Removal - Part I
Recently several authors have stressed and illustrated the importance of including a second kind of negation (explicit negation) in logic programs besides \negation as failure", and its use in deductive databases, knowledge representation, and nonmonotonic reasoning. By introducing explicit negation into logic programs contradiction may appear. In this work we present two approaches for dealing...
متن کاملThe Effect of Partial Deduction in Abductive Reasoning
Partial deduction is known as an optimization technique in logic programming. In the context of abductive logic programming, however, we present in this paper that normal partial deduction does not preserve explanations for abductive reasoning. Then we provide an alternative method of partial deduction, called abductive partial deduction, which is shown to preserve the meanings of abductive log...
متن کامل